Automata theory - PDFSEARCH.IO - Document Search Engine

Automata theory
Results: 1263

#	Item
681	PhD Dissertation International Doctorate School in Information and Communication Technologies Department of Information Engineering and Computer Science Add to Reading List Source URL: eprints-phd.biblio.unitn.it Language: English - Date: 2010-05-03 04:31:34 Computing Computer arithmetic Modulo operation Automata theory
682	From Regular Expressions to Parsing Expression Grammars S´ergio Medeiros1 , Fabio Mascarenhas2 , Roberto Ierusalimschy3 1 Department of Computer Science – UFS – Aracaju – Brazil Add to Reading List Source URL: www.lbd.dcc.ufmg.br Language: English - Date: 2011-11-01 13:15:44 Theoretical computer science Pattern matching Regular expressions Parsing expression grammar Function Regular language Exponentiation Formal languages Mathematics Automata theory
683	Hindawi Publishing Corporation Discrete Dynamics in Nature and Society Volume 2014, Article ID[removed], 8 pages http://dx.doi.org[removed][removed]Research Article Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-28 08:04:07 Attractor Dynamical system Topological conjugacy Structure Cellular automata Topology Cellular automaton Chaos theory
684	Baba Ghulam Shah Badshah University Rajouri (J&K) Result Notification No. 436 of 2014 Dated: [removed]Result of Semester – VI Regular End-of-Semester Examination held in May-June, 2014 Add to Reading List Source URL: www.bgsbuniversity.org Language: English - Date: 2014-11-28 00:38:37 Software engineering Theoretical computer science Computing Automata theory Pattern matching Regular expression
685	“Maximal-Munch” Tokenization in Linear Time THOMAS REPS University of Wisconsin The lexical-analysis (or scanning) phase of a compiler attempts to partition an input string Add to Reading List Source URL: www.csc.lsu.edu Language: English - Date: 2002-06-08 18:46:58 Computing Automata theory Parsing Models of computation Lexical analysis Maximal munch Tokenization Finite-state machine Algorithm Programming language implementation Compiler construction Software engineering
686	Finite-State Transducer Cascade to Extract Proper Names in Texts Nathalie Friburger and Denis Maurel Laboratoire d’Informatique de Tours E3i, 64 avenue Jean Portalis, 37000 Tours {friburger,maurel}@univ-tours.fr Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2006-04-03 11:21:43 Models of computation Language Computational linguistics Natural language processing Speech recognition Finite state transducer Finite-state machine Family name Proper noun Linguistics Languages of Europe Automata theory
687	Using Finite State Technology in Natural Language Processing of Basque Iñaki Alegria, Maxux Aranzabe, Nerea Ezeiza, Aitzol Ezeiza, and Ruben Urizar Ixa taldea, University of the Basque Country, Spain [removed] Add to Reading List Source URL: www.cs.mun.ca Language: English - Date: 2006-01-27 09:29:09 Automata theory Models of computation Inflection Transducer Agglutination Lexicon Morpheme Finite-state machine Morphology Linguistics Linguistic morphology Grammar
688	Enforceable Security Policies1 Fred B. Schneider Department of Computer Science Cornell University Ithaca, New York[removed]January 15, 1998 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2013-09-09 20:16:06 Security policy Computer security Public safety Government Automata theory Security Policy
689	COMPUTER SCIENCE TRIPOS Part IA – 2014 – Paper 2 10 Discrete Mathematics (AMP) (a) For each symbol x in the alphabet Σ = {a, b, c}, let Ox be the language over Σ consisting of all strings that contain an odd number Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2014-06-09 10:18:43 Models of computation Combinatorics Computer science Combinatorics on words Deterministic finite automaton Nondeterministic finite automaton Regular language String Regular expression Automata theory Formal languages Theoretical computer science
690	Enforceable Security Policies FRED B. SCHNEIDER Cornell University A precise characterization is given for the class of security policies enforceable with mechanisms that work by monitoring system execution, and automata Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2001-11-26 17:13:32 Formal methods Security Büchi automaton Computer security State Security policy Kernel Finite-state machine Models of computation Automata theory Theoretical computer science

UPDATE